On the minimality of Hamming compatible metrics

نویسندگان

  • Parsa Bakhtary
  • Othman Echi
چکیده

A Hamming compatible metric is an integer-valued metric on the words of a finite alphabet which agrees with the usual Hamming distance for words of equal length. We define a new Hamming compatible metric, compute the cardinality of a sphere with respect to this metric, and show this metric is minimal in the class of all “well-behaved” Hamming compatible metrics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harmonicity and Minimality of Vector Fields on Lorentzian Lie Groups

‎We consider four-dimensional lie groups equipped with‎ ‎left-invariant Lorentzian Einstein metrics‎, ‎and determine the harmonicity properties ‎of vector fields on these spaces‎. ‎In some cases‎, ‎all these vector fields are critical points for the energy functional ‎restricted to vector fields‎. ‎We also classify vector fields defining harmonic maps‎, ‎and calculate explicitly the energy of t...

متن کامل

Minimality for punctured convolutional codes

AhtracrThis paper investigates encoders optimization for Hamming weight after periodic puncturing, rind discusses minimality issues that may affect the performanoe of the punctured encoders. Periodically puncturing a minimal encoder produces a higher rate encoder that may or may not be minimal. If it is not minimal, it may have a zero-output loop and it may be Catastrophic. A code search can us...

متن کامل

Inverse Maximum Dynamic Flow Problem under the Sum-Type Weighted Hamming Distance

Inverse maximum flow (IMDF), is among the most important problems in the field ofdynamic network flow, which has been considered the Euclidean norms measure in previousresearches. However, recent studies have mainly focused on the inverse problems under theHamming distance measure due to their practical and important applications. In this paper,we studies a general approach for handling the inv...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

Using New Techniques and Devices within the Set of Tiba Body Roller Hamming Robots

In this article, new techniques and technologies have been tried and tested in the installation and commissioning of Roller Home industrial robots, in order to produce a Tiba car with a focus on cost reduction. Due to the fact that press equipment for automobile parts requires a lot of expenses, it was decided to use robots with the same function of roller to reduce costs and increase the q...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1201.1633  شماره 

صفحات  -

تاریخ انتشار 2012